Extremal Cases of the Ahlswede-Cai Inequality
نویسندگان
چکیده
We are concerned with the poset P(n)=P([1, 2, ..., n]). This is the power set of [n]=[1, 2, ..., n], ordered by inclusion. A set system is simply a subset of P(n). A set system is an antichain if no two of its members are comparable. Conversely a chain is a totally ordered set system. We shall often consider maximal chains; those chains which cannot be extended. In particular such chains contain exactly one set from each of the levels of P(n). The kth level is the system [n]=[A # P(n) : |A|=k]. There are exactly n! maximal chains in P(n). Occasionally we think of P(n) as a graph with edges AB for all A, B # P(n) with |A2B|=1. An upset is a set system U with the property that A#B # U implies A # U. A downset is defined similarly. If A is an arbitrary set system we use U (A) to denote the upset generated by A ; i.e., U (A)= [X # P(n) : _A # A, A/X]. The downset generated by A, denoted D(A), is defined similarly.
منابع مشابه
General Edge-isoperimetric Inequalities, Part II: a Local-Global Principle for Lexicographical Solutions
The lexicographical order ᏸ on a sequence space ᐄ n ϭ ͕ 0 , 1 ,. .. , ␣ ͖ n , defined by x n Ͻ ᏸ y n if f there exists a t such that x t Ͻ y t and x s ϭ y s for s Ͻ t , is one of the most important and frequently encountered orders in combinatorial extremal theory. An early result in this area , Harper's solution of an edge-isoperimetric problem (EIP) in binary Hamming space ([13]) (generalized i...
متن کاملTowards characterizing equality in correlation inequalities
For most of the basic inequalities in mathematics we know conditions which completely specify the cases of equality. Many combinatorial correlation inequalities are special cases of the AD-inequality, as explained in [3, 8, 10]. However, for this inequality it seems to be difficult to classify the cases of equality. Certainly this is even more difficult for the much more general inequalities of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 76 شماره
صفحات -
تاریخ انتشار 1996